Resolving inconsistencies among constraints on the parameters of an MCDA model

We consider a framework where decision makers (DMs) interactively define a multicriteria evaluation model by providing imprecise information (i.e., a linear system of constraints to the model s parameters) and by analyzing the consequences of the information provided. DMs may introduce new constraints explicitly or implicitly (results that the model should yield). If a new constraint is incompatible with the previous ones, then the system becomes inconsistent and the DMs must choose between removing the new constraint or removing some of the older ones. We address the problem of identifying subsets of constraints which, when removed, lead to a consistent system. Identifying such subsets would indicate the reason for the inconsistent information given by DMs. There may exist several possibilities for the DMs to resolve the inconsistency. We present two algorithms to identify such possibilities, one using {0,1} mixed integer linear programming and the other one using linear programming. Both approaches are based on the knowledge that the system was consistent prior to introducing the last constraint. The output of these algorithms helps the DM to identify the conflicting pieces of information in a set of statements he/she asserted. The relevance of these algorithms for MCDA is illustrated by an application to an aggregation/disaggregation procedure for the Electre Tri method. 2002 Elsevier Science B.V. All rights reserved.